Direction Oriented Pathfinding in Video Games
نویسندگان
چکیده
Pathfinding has been one of major research areas in video games for many years. It is a key problem that most video games are confronted with. Search algorithm such as Dijkstra’s algorithm and A* algorithm are representing only half of the picture. The underlying map representations such as regular grid, visibility graph and navigation mesh also have significant impact on the performance. This paper reviews the current widely used solutions for pathfinding and proposes a new method which is expected to generate a higher quality path using less time and memory than other existing solutions. The deployment of methodology and techniques is described in detail. The aim and significance of the proposed method in future video games is addressed and the conclusion is given at the end.
منابع مشابه
Pathfinding in Computer Games
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This report will highlight pathfinding algorithms used presently in games and their shortcomings especially when dealing with real-time pathfinding. With the advances being made in other com...
متن کاملReal-time Heuristic Search for Pathfinding in Video Games
Game pathfinding is a challenging problem due to a limited amount of per-frame CPU time commonly shared among many simultaneously pathfinding agents. The challenge is rising with each new generation of games due to progressively larger and more complex environments and larger numbers of agents pathfinding in them. Algorithms based on A* tend to scale poorly as they must compute a complete, poss...
متن کاملAutomatic State Abstraction for Pathfinding in Real-Time Video Games
Real-time video games are a unique domain for pathfinding and search. Traditional approaches to search have usually assumed static worlds with a single agent. But, in real-time video games there are multiple cooperative and adversarial agents. While the search space in most games is relatively small, algorithms are expected to plan in mere milliseconds. Thus, techniques such as abstraction are ...
متن کاملRealistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This paper examines pathfinding algorithms used presently in games and details their shortcomings. These shortcomings are particularly apparent when pathfinding must be carried out in real-t...
متن کاملPathfinding Based on Pattern Detection Using Genetic Algorithms
This paper presents a novel method to optimize the process of finding paths using a model based on Genetic Algorithms and Best-First-Search for real time systems, such as video games and virtual reality environments. The proposed solution uses obstacle pattern detection based at online training system to guarantee the memory economy. The architecture named Patterned based Pathfinding with Genet...
متن کامل